Geometric Construction of Coordinates for Convex Polyhedra using Polar Duals
نویسندگان
چکیده
A fundamental problem in geometry processing is that of expressing a point inside a convex polyhedron as a combination of the vertices of the polyhedron. Instances of this problem arise often in mesh parameterization and 3D deformation. A related problem is to express a vector lying in a convex cone as a non-negative combination of edge rays of this cone. This problem also arises in many applications such as planar graph embedding and spherical parameterization. In this paper, we present a unified geometric construction for building these weighted combinations using the notion of polar duals. We show that our method yields a simple geometric construction for Wachspress’s barycentric coordinates, as well as for constructing Colin de Verdière matrices from convex polyhedra—a critical step in Lovasz’s method with applications to parameterizations.
منابع مشابه
Mean value coordinates in 3D
Abstract: Trivariate barycentric coordinates can be used both to express a point inside a tetrahedron as a convex combination of the four vertices and to linearly interpolate data given at the vertices. In this paper we generalize these coordinates to convex polyhedra and the kernels of star-shaped polyhedra. These coordinates generalize in a natural way a recently constructed set of coordinate...
متن کاملA general geometric construction of coordinates in a convex simplicial polytope
Barycentric coordinates are a fundamental concept in computer graphics and geometric modeling. We extend the geometric construction of Floater’s mean value coordinates [8,11] to a general form that is capable of constructing a family of coordinates in a convex 2D polygon, 3D triangular polyhedron, or a higher-dimensional simplicial polytope. This family unifies previously known coordinates, inc...
متن کاملInterpolation Error Estimates for Harmonic Coordinates on Polytopes
Interpolation error estimates in terms of geometric quality measures are established for harmonic coordinates on polytopes in two and three dimensions. First we derive interpolation error estimates over convex polygons that depend on the geometric quality of the triangles in the constrained Delaunay triangulation of the polygon. This characterization is sharp in the sense that families of polyg...
متن کاملOn Polar Cones and Differentiability in Reflexive Banach Spaces
Let $X$ be a Banach space, $Csubset X$ be a closed convex set included in a well-based cone $K$, and also let $sigma_C$ be the support function which is defined on $C$. In this note, we first study the existence of a bounded base for the cone $K$, then using the obtained results, we find some geometric conditions for the set $C$, so that ${mathop{rm int}}(mathrm{dom} sigma_C) neqem...
متن کاملWhen can a graph form an orthogonal polyhedron?
Polyhedra are an important basic structure in computational geometry. One of the most beautiful results concerning polyhedra is Cauchy’s theorem, which states that a convex polyhedron is uniquely defined by its graph, edge lengths and facial angles. (See Section 2 for definitions.) The proof of Cauchy’s theorem (see e.g. [2]) unfortunately is nonconstructive, and the only known algorithm to rec...
متن کامل